package FloodFill;

import java.util.LinkedList;
import java.util.Queue;

public class FloodFill {
    int[] dx = {0, 0, 1, -1};
    int[] dy = {1, -1, 0, 0};

    public int[][] code(int[][] image, int sr, int sc, int color) {
        int prev = image[sr][sc];

        if (prev == color){
            return image;
        }

        int m = image.length, n = image[0].length;

        Queue<int[]> q = new LinkedList<>();
        q.add(new int[]{sr, sc});

        while (!q.isEmpty()){
            int[] t = q.poll();
            int a = t[0], b = t[1];
            image[a][b] = color;

            for (int i = 0; i < 4; i++){
                int x = a + dx[i], y = b + dy[i];
                if (x >= 0 && x < m && y >= 0 && y < n && image[x][y] == prev){
                    q.add(new int[]{x, y});
                }
            }
        }

        return image;
    }

    public static void main(String[] args) {
        FloodFill test = new FloodFill();
        test.code(new int[][]{{1, 1, 1}, {1, 1, 0}, {1, 0, 1}}, 1, 1, 2);
    }
}
